On Hamiltonian properties of powers of special Hamiltonian graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Powers of Hamiltonian paths in interval graphs

We give a simple proof that the obvious necessary conditions for a graph to contain the kth power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We will also discuss covers by powers of paths and analogues of the Hamiltonian completion number. c © ...

متن کامل

Partitioning powers of traceable or hamiltonian graphs

A graph G = (V,E) is arbitrarily partitionable (AP) if for any sequence τ = (n1, . . . , np) of positive integers adding up to the order of G, there is a sequence of mutually disjoints subsets of V whose sizes are given by τ and which induce connected graphs. If, additionally, for given k, it is possible to prescribe l = min{k, p} vertices belonging to the first l subsets of τ , G is said to be...

متن کامل

Hamiltonian properties of Toeplitz graphs

Condit ions are given for the existence of hamiltonian paths and cycles in the so-called Toeplitz graphs, i.e. simple graphs with a symmetric Toeplitz adjacency matrix.

متن کامل

Some Hamiltonian Results in Powers of Graphs * Arthur

In this paper we show that the connectivity of the kth power of a graph of connectivity m is at least km if the kth power of the graph is not a complete graph. Also, we. prove th at removing as many as k 2 vertices from the kth power of a graph (k ;;. 3) leaves a Hamiltonian graph, and that removing as many as k 3 vertices from the kth power of a graph (k;;' 3) leaves a Hamiltonian con nected g...

متن کامل

Hamiltonian properties of triangular grid graphs

A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-connected, linearly convex triangular grid graphs (with the exception of one of them) are hamiltonian. The only exception is a graph D which is the linearlyconvex hull of the Star of David. We extend this result to a wider...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1974

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-29-1-113-117